Model-based clustering for random hypergraphs
نویسندگان
چکیده
منابع مشابه
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These discovered clusters are used to explain the characteristics of the data distribution. In this paper we propose a new methodology for clustering related items using association rules, and clustering related transactions ...
متن کاملOrientability Thresholds for Random Hypergraphs
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are all of cardinality h. To w-orient a hyperedge, we assign exactly w of its vertices positive signs with respect to the hyperedge, and the rest negative. A (w, k)-orientation of H consists of a w-orientation of all hyperedges of H, such that each vertex receives at most k positive signs from its incident hypere...
متن کاملMantel's theorem for random hypergraphs
A cornerstone result in extremal graph theory is Mantel’s Theorem, which states that every maximum triangle-free subgraph of Kn is bipartite. A sparse version of Mantel’s Theorem is that, for sufficiently large p, every maximum triangle-free subgraph of G(n, p) is w.h.p. bipartite. Recently, DeMarco and Kahn proved this for p > K √ log n/n for some constant K, and apart from the value of the co...
متن کاملQuasi-Random Hypergraphs and Extremal Problems for Hypergraphs
The regularity lemma was originally developed by Szemerédi in the seventies as a tool to resolve a long standing conjecture of Erdős and Turán, that any subset of the integers of positive upper density contains arbitrary long arithmetic progressions. Soon this lemma was recognized as an important tool in extremal graph theory and it also has had applications to additive number theory, discrete ...
متن کاملChoosability in Random Hypergraphs
The choice number of a hypergraph H = (V, E) is the least integer s for which for every family of color lists S = {S(v) : v ∈ V }, satisfying |S(v)| = s for every v ∈ V , there exists a choice function f so that f(v) ∈ S(v) for every v ∈ V , and no edge of H is monochromatic under f . In this paper we consider the asymptotic behavior of the choice number of a random k-uniform hypergraph H(k, n,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Data Analysis and Classification
سال: 2021
ISSN: 1862-5347,1862-5355
DOI: 10.1007/s11634-021-00454-7